Modeling and solving assembly line worker assignment and balancing problem with sequence-dependent setup times

Assembly lines appear with various differentiations in order to better include the disabled labor market and increase production efficiency. In this way, optimal workforce assignment problem that emerges heterogeneously is called assembly line worker balancing (ALWABP). This paper addresses ALWABP where simple version enriched by considering sequence-dependent setup times between tasks. A mixed integer linear programming model presented, a simulated annealing algorithm developed such as an NP-hard problem. test proposed solutions, 640 benchmark problems literature were combined used. The solutions obtained through using are compared on small-size problems. Experimental results show more effective robust for large set of